More Accurate Entity Ranking Using Knowledge Graph and Web Corpus
نویسندگان
چکیده
Recent years have witnessed some convergence in the architecture of entity search systems driven by a knowledge graph (KG) and a corpus with annotated entity mentions. However, each specific system has some limitations. We present AQQUCN, an entity search system that combines the best design principles into a public reference implementation. AQQUCN does not depend on well-formed question syntax, but works equally well with syntax-poor keyword queries. It uses several convolutional networks (convnets) to extract subtle, overlapping roles of query words. Instead of ranking structured query interpretations, which are then executed on the KG to return unranked sets, AQQUCN directly ranks response entities, by closely integrating coarse-grained predicates from the KG with fine-grained scoring from the corpus, into a single ranking model. Over and above competitive F1 score, AQQUCN gets the best entity ranking accuracy on two syntax-rich and two syntaxpoor public query workloads amounting to over 8,000 queries, with 16– 18% absolute improvement in mean average precision (MAP), compared to recent systems.
منابع مشابه
Towards Supporting Exploratory Search over the Arabic Web Content: The Case of ArabXplore
Due to the huge amount of data published on the Web, the Web search process has become more difficult, and it is sometimes hard to get the expected results, especially when the users are less certain about their information needs. Several efforts have been proposed to support exploratory search on the web by using query expansion, faceted search, or supplementary information extracted from exte...
متن کاملEntity Ranking and Relationship Queries using an Extended Graph Model
There is a large amount of textual data on the Web and in Wikipedia, where mentions of entities (such as Gandhi) are annotated with a link to the disambiguated entity (such as M. K. Gandhi). Such annotation may have been done manually (as in Wikipedia) or can be done using named entity recognition/disambiguation techniques. Such an annotated corpus allows queries to return entities, instead of ...
متن کاملTimely Semantics: A Study of a Stream-Based Ranking System for Entity Relationships
In recent years, search engines have started presenting semantically relevant entity information together with document search results. Entity ranking systems are used to compute recommendations for related entities that a user might also be interested to explore. Typically, this is done by ranking relationships between entities in a semantic knowledge graph using signals found in a data source...
متن کاملSeparating Wheat from the Chaff - A Relationship Ranking Algorithm
We address the problem of ranking relationships in an automatically constructed knowledge graph. We propose a probabilistic ranking mechanism that utilizes entity popularity, entity affinity, and support from text corpora for the relationships. Results obtained from preliminary experiments on a standard dataset are encouraging and show that our proposed ranking mechanism can find more informati...
متن کاملCross-Document Co-Reference Resolution using Sample-Based Clustering with Knowledge Enrichment
Identifying and linking named entities across information sources is the basis of knowledge acquisition and at the heart of Web search, recommendations, and analytics. An important problem in this context is cross-document coreference resolution (CCR): computing equivalence classes of textual mentions denoting the same entity, within and across documents. Prior methods employ ranking, clusterin...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- CoRR
دوره abs/1706.00973 شماره
صفحات -
تاریخ انتشار 2017